Is Timetabling Routing Always Reliable for Public Transport?
نویسندگان
چکیده
Current route planning algorithms for public transport networks are mostly based on timetable information only, i.e., they compute shortest routes under the assumption that all transit vehicles (e.g., buses, subway trains) will incur in no delays throughout their trips. Unfortunately, unavoidable and unexpected delays often prevent transit vehicles to respect their originally planned schedule. In this paper, we try to measure empirically the quality of the solutions offered by timetabling routing in a real public transport network, where unpredictable delays may happen with a certain frequency, such as the public transport network of the metropolitan area of Rome. To accomplish this task, we take the time estimates required for trips provided by a timetablingbased route planner (such as Google Transit) and compare them against the times taken by the trips according to the actual tracking of transit vehicles in the transport network, measured through the GPS data made available by the transit agency. In our experiments, the movement of transit vehicles was only mildly correlated to the timetable, giving strong evidence that in such a case timetabled routing may fail to deliver optimal or even high-quality solutions. 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity, F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
A Novel Method for Measuring the Quality of Temporal Integration in Public Transport Systems
Temporal coordination of services, as a crucial aspect of integration in public transport systems, has always been a big concern for transit planners and schedulers. One of the major issues in the way of coordinating transit services is the lack of a robust measure of effectiveness for assessing the quality of temporal coordination in public transport systems. Even though the network-wide summa...
متن کاملPassenger routing for periodic timetable optimization
The task of periodic timetabling is to schedule the trips in a public transport system by determining arrival and departure times at every station such that travel and transfer times are minimized. To date, the optimization literature generally assumes that passengers do not respond to changes in the timetable, i.e., the passenger routes are fixed. This is unrealistic and ignores potentially va...
متن کاملRouting in Graphs with Applications to Material Flow Problems
Material flow problems are complex logistic optimization problems. We want to utilize the available logistic network in such a way that the load is minimized or the throughput is maximized. This lecture deals with these optimization problems from the viewpoint of network flow theory and reports on two industrial applications: (1) contolling material flow with automated guided vehicles in a cont...
متن کاملA novel bi-objective reliable location routing model considering impedance function under demand-side and supply-side uncertainty (A Case study)
Reliable location routing problem considers a location problem and a vehicle routing problem in order to select the optimal location of facilities and at the same time the optimal routes for vehicles considering the unexpected failure for facilities in which, all facilities may fail with a probability. In this paper, a bi-objective mathematical model has been developed to minimize the total cos...
متن کامل